An official website of the United States government Here's how you know

Official websites use .gov

A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS

A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Search for: All records

Creators/Authors contains: "Reiher, Christian"

« Prev Next »

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

Colouring versus density in integers and Hales Jewett cubes

Reiher, Christian; Rödl, Vojtech; Sales, Marcelo (October 2024, Journal of the London Mathematical Society)

Full Text Available
Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links

https://doi.org/10.1016/j.procs.2021.11.050

Berger, Sören; Piga, Simón; Reiher, Christian; Rödl, Vojtěch; Schacht, Mathias (January 2021, Procedia Computer Science)

Full Text Available
On quantitative aspects of a canonisation theorem for edge‐orderings

https://doi.org/10.1112/jlms.12648

Reiher, Christian; Rödl, Vojtěch; Sales, Marcelo; Sames, Kevin; Schacht, Mathias (June 2022, Journal of the London Mathematical Society)
Minimum pair degree condition for tight Hamiltonian cycles in 4-uniform hypergraphs

https://doi.org/10.1007/s10474-020-01078-7

Polcyn, Joanna; Reiher, Christian; Rodl, Vojtech; Schacht, Mathias; Schulke, Bjarne (January 2020, Acta mathematica Hungarica)

We show that every 4-uniform hypergraph with n vertices and minimum pair degree at least (5/9+𝑜(1))𝑛2/2 contains a tight Hamiltonian cycle. This degree condition is asymptotically optimal.
more » « less
Full Text Available
Minimum pair degree condition for tight Hamiltoinion cycles in 4-uniform hypergraphs

Polcyn, Joana; Reiher, Christian; Rodl, Vojta; Rucinski, Andrzej; Schacht, Mathias (January 2020, Acta mathematica Hungarica)

Full Text Available
Minimum vertex degree condition for tight Hamiltonian cycles in 3‐uniform hypergraphs

https://doi.org/10.1112/plms.12235

Reiher, Christian; Rödl, Vojtěch; Ruciński, Andrzej; Schacht, Mathias; Szemerédi, Endre (February 2019, Proceedings of the London Mathematical Society)